Variable-mixing parameter quantized kernel robust mixed-norm algorithms for combating impulsive interference

نویسندگان

  • Lu Lu
  • Haiquan Zhao
  • Badong Chen
چکیده

Although the kernel robust mixed-norm (KRMN) algorithm outperforms the kernel least mean square (KLMS) algorithm in impulsive noise, it still has two major problems as follows: (1) The choice of the mixing parameter in the KRMN is crucial to obtain satisfactory performance. (2) The structure of KRMN grows linearly as the iteration goes on, thus it has high computational burden and memory requirement. To solve the parameter selection problem, two variable-mixing parameter KRMN (VPKRMN) algorithms are developed in this paper. Moreover, a sparsification algorithm, quantized VPKRMN (QVPKRMN) algorithm is introduced for nonlinear system identification under impulsive interference environment. The energy conservation relation (ECR) and convergence property of QVPKRMN algorithm is analyzed. Simulations in the context of nonlinear system identification under impulsive interference demonstrate that the proposed VPKRMN and QVPKRMN algorithms provide superior performance than existing algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Robust Distributed Estimation Algorithm under Alpha-Stable Noise Condition

Robust adaptive estimation of unknown parameter has been an important issue in recent years for reliable operation in the distributed networks. The conventional adaptive estimation algorithms that rely on mean square error (MSE) criterion exhibit good performance in the presence of Gaussian noise, but their performance drastically decreases under impulsive noise. In this paper, we propose a rob...

متن کامل

A variable-parameter normalized mixed-norm (VPNMN) adaptive algorithm

Since both the least mean-square (LMS) and least mean-fourth (LMF) algorithms suffer individually from the problem of eigenvalue spread, so will the mixed-norm LMS-LMF algorithm. Therefore, to overcome this problem for the mixed-norm LMS-LMF, we are adopting here the same technique of normalization (normalizing with the power of the input) that was successfully used with the LMS and LMF separat...

متن کامل

Affine projection sign algorithm with ℓ1 minimization-based variable step-size

In this paper, a new affine projection sign algorithm with a variable step-size, robust in impulsive noise environments, is proposed. For that purpose, l1-norm of the a posteriori error vector is minimized under a box constraint on the step-size. Since the proposed l1-norm minimization problem is non-differentiable convex one, an efficient numerical procedure is developed for the affine project...

متن کامل

Sparsity-Aware and Noise-Robust Subband Adaptive Filter

This paper presents a subband adaptive filter (SAF) for a system identification where an impulse response is sparse and disturbed with an impulsive noise. Benefiting from the uses of l1-norm optimization and l0-norm penalty of the weight vector in the cost function, the proposed l0-norm sign SAF (l0-SSAF) achieves both robustness against impulsive noise and much improved convergence behavior th...

متن کامل

Robust multiuser detection in non-Gaussian channels

In many wireless systems where multiuser detection techniques may be applied, the ambient channel noise is known through experimental measurements to be decidedly nonGaussian, due largely to impulsive phenomena. The performance of many multiuser detectors can degrade substantially in the presence of such impulsive ambient noise. In this paper, we develop robust multiuser detection techniques fo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1508.05232  شماره 

صفحات  -

تاریخ انتشار 2015